Reducing network traffic in unstructured P2P systems using Top-k queries
نویسندگان
چکیده
منابع مشابه
Reducing Network Traffic in Unstructured P 2 P Systems Using Top - k Queries 1
A major problem of unstructured P2P systems is their heavy network traffic. This is caused mainly by high numbers of query answers, many of which are irrelevant for users. One solution to this problem is to use Top-k queries whereby the user can specify a limited number (k) of the most relevant answers. In this paper, we present FD, a (Fully Distributed) framework for executing Top-k queries in...
متن کاملReducing User Waiting Time for Top-k Queries in Unstructured P2P Systems
Dans les systèmes pair-à-pair (P2P) non-structurés, les requêtes de type top-k sont une solution intéressante, car elles évitent de submerger l’utilisateur avec un grand nombre de réponses. Cependant, les techniques existantes présentent l’inconvénient d’un temps d’attente important pour l’utilisateur. En effet, pour que le résultat de la requête topk soit retourné à l’utilisateur, les réponses...
متن کاملAnswering Constrained k-NN Queries in Unstructured P2P Systems
The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructured P2P system is not well studied despite of their popularity. Communication-efficient processing of k-NN queries in such an environment is a unique challenge due to the distribution, dynamics and large scale of the s...
متن کاملReducing Cross-ISP Traffic of P2P Systems: TheEnd or The Beginning of P2P Traffic Control
As Peer-to-Peer (P2P) systems are widely deployed in the Internet, P2P traffic control becomes a challenge for Internet Service Providers (ISPs) and P2P system vendors. Some recent works consider the interaction between ISPs and P2P systems and propose ISP-friendly P2P traffic control mechanisms for reducing cross-ISP traffic. In this paper, we consider another fundamental problem: the interact...
متن کاملEfficient Early Top-k Query Processing in Overloaded P2P Systems
Top-k query processing in P2P systems has focused on efficiently computing the top-k results while reducing network traffic and query response time. However, in overloaded P2P systems (with very high query loads), some peers may take a long time to answer, thus making the user wait a long time to obtain the final top-k result. In this paper, we address this problem, which we reformulate as earl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed and Parallel Databases
سال: 2006
ISSN: 0926-8782,1573-7578
DOI: 10.1007/s10619-006-8313-5